Minimal Degree Coprime Factorization of Rational Matrices

نویسندگان

  • Cristian Oara
  • András Varga
چکیده

Given a rational matrix G with complex coefficients and a domain Γ in the closed complex plane, both arbitrary, we develop a complete theory of coprime factorizations of G over Γ, with denominators of McMillan degree as small as possible. The main tool is a general pole displacement theorem which gives conditions for an invertible rational matrix to dislocate by multiplication a part of the poles of G. We apply this result to obtain the parametrized class of all coprime factorizations over Γ with denominators of minimal McMillan degree nb—the number of poles of G outside Γ. Specific choices of the parameters and of Γ allow us to determine coprime factorizations, as for instance, with polynomial, proper, or stable factors. Further, we consider the case in which the denominator has a certain symmetry, namely it is J all-pass with respect either to the imaginary axis or to the unit circle. We give necessary and sufficient solvability conditions for the problem of coprime factorization with J all-pass denominator of McMillan degree nb and, when a solution exists, we give a construction of the class of coprime factors. When no such solution exists, we discuss the existence of, and give solutions to, coprime factorizations with J all-pass denominators of minimal McMillan degree (> nb). All the developments are carried out in terms of descriptor realizations associated with rational matrices, leading to explicit and computationally efficient formulas.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of Normalized Coprime Factorizations of Rational Matrices

We propose a new computational approach based on descriptor state space algorithms for computing normalized coprime factorizations of arbitrary rational matrices. The proposed approach applies to both continuousand discrete-time rational transfer-function matrices and shows that each rational matrix possesses a normalized coprime factorization with proper factors. The new method is conceptually...

متن کامل

Recursive computation of coprime factorizations

We propose general computational procedures based on descriptor state-space realizations to compute coprime factorizations of rational matrices with minimum degree denominators. Enhanced recursive pole dislocation techniques are developed, which allow to successively place all poles of the factors into a given “good” domain of the complex plane. The resulting McMillan degree of the denominator ...

متن کامل

Rational and Polynomial Matrices

where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1999